منابع مشابه
Playing Games in the Baire Space
We solve a generalized version of Church’s Synthesis Problem where a play is given by a sequence of natural numbers rather than a sequence of bits; so a play is an element of the Baire space rather than of the Cantor space. Two players Input and Output choose natural numbers in alternation to generate a play. We present a natural model of automata (“N-memory automata”) equipped with the parity ...
متن کاملTechnology-Mediated Experience of Space while Playing Digital Sports Games
The general aim of the research project presented in this paper is to analyze the different interactions between human, technology and space within existing theoretical frameworks from different disciplines and to apply these approaches to digital sports games. One particular aim is to investigate the impact of playing expertise or a manipulation of game situations, as well as the use of differ...
متن کاملCompact subsets of the Baire space
Let P be the natural forcing for producing a finite splitting tree using finite conditions. Namely, p ∈ P iff p ⊆ ω is a finite subtree and p ≤ q iff p ⊇ q is an end extension of q. End extension means if s ∈ p\q then s ⊇ t for some t ∈ q which is terminal in q, i.e., has no extensions in q. This order is countable and hence forcing equivalent to adding a single Cohen real. The union of P-gener...
متن کاملPlaying Games with Timed Games
In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. Following the example of timed simulation between timed automata, we define timed alternating simulation as a preorder between timed game automata, which preserves controllability. We define a method to reduce the timed alternating simulation prob...
متن کاملComputable Analysis Over the Generalized Baire Space
One of the main goals of computable analysis is that of formalizing the complexity of theorems from real analysis. In this setting Weihrauch reductions play the role that Turing reductions do in standard computability theory. Via coding, we can transfer computability and topological results from the Baire space ω to any space of cardinality 2א0 , so that e.g. functions over R can be coded as fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.220.2